A Superposition Oriented Theorem Prover
نویسنده
چکیده
A theorem proving procedure is described which combines the approach of locking resolution with that of rewriting systems. Indeed, both the binary resolution and a complete restr ict ion of paramodulation are embodied by an extension of the rewriting operation called superposition. Experimental results are reported and compared with l i terature automated proofs.
منابع مشابه
Cooperation Between Top-Down and Bottom-Up Theorem Provers by Subgoal Clause Transfer
Top-down and bottom-up theorem proving approaches have each specific advantages and disadvantages. Bottom-up provers profit from strong redundancy control and suffer from the lack of goal-orientation, whereas top-down provers are goal-oriented but have weak calculi when their proof lengths are considered. In order to integrate both approaches our method is to achieve cooperation between a top-d...
متن کاملCooperation between Top - Down and Bottom
Top-down and bottom-up theorem proving approaches have each speciic advantages and disadvantages. Bottom-up provers proot from strong redundancy control and suuer from the lack of goal-orientation, whereas top-down provers are goal-oriented but have weak calculi when their proof lengths are considered. In order to integrate both approaches our method is to achieve cooperation between a top-down...
متن کاملBeagle - A Hierarchic Superposition Theorem Prover
Beagle is an automated theorem prover for first-order logic modulo built-in theories. It implements a refined version of the hierarchic superposition calculus. This system description focuses on Beagle’s proof procedure, background reasoning facilities, implementation, and experimental results.
متن کاملE - a brainiac theorem prover
We describe the superposition-based theorem prover E. E is a sound and complete prover for clausal first order logic with equality. Important properties of the prover include strong redundancy elimination criteria, the DISCOUNT loop proof procedure, a very flexible interface for specifying search control heuristics, and an efficient inference engine. We also discuss strength and weaknesses of t...
متن کاملSystem Description : E 1 . 8 Stephan Schulz
E is a theorem prover for full first-order logic with equality. It reduces first-order problems to clause normal form and employs a saturation algorithm based on the equational superposition calculus. E is built on shared terms with cached rewriting, and employs several innovations for efficient clause indexing. Major strengths of the system are automatic problem analysis and highly flexible se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 35 شماره
صفحات -
تاریخ انتشار 1983